1496C - Diamond Miner - CodeForces Solution


geometry greedy sortings *1200

Please click on ads to support us..

Python Code:

import math
import sys


for m in range(int(input())):
    n=int(input())
    ax=[]
    ay=[]
    for i in range(2*n):
        x,y=map(int,input().split()) 
            if(x==0):
            ay.append(abs(y))
        if(y==0):
            ax.append(abs(x))
    ax.sort()
    ay.sort()
        ans=0
        for i in range(n):
        ans+=(math.sqrt((ax[i]**2) + (ay[i]**2)))
    print(ans)

    


Comments

Submit
0 Comments
More Questions

901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro
780C - Andryusha and Colored Balloons
1153A - Serval and Bus
1487C - Minimum Ties
1136A - Nastya Is Reading a Book
1353B - Two Arrays And Swaps
1490E - Accidental Victory
1335A - Candies and Two Sisters
96B - Lucky Numbers (easy)
1151B - Dima and a Bad XOR
1435B - A New Technique
1633A - Div 7
268A - Games
1062B - Math
1294C - Product of Three Numbers
749A - Bachgold Problem
1486B - Eastern Exhibition
1363A - Odd Selection
131B - Opposites Attract